A CEGAR-based Approach for Proving Invariant Properties of Transition Systems on Non-Linear Real Arithmetic
نویسندگان
چکیده
Model checking invariant properties of designs, represented as transition systems, with non-linear real arithmetic (NRA) is an important though very hard problem. On the one hand NRA is a hard-to-solve theory; on the other hand most of the powerful model checking techniques lack support for NRA. In this paper, we present a work-in-progress counterexampleguided abstraction refinement (CEGAR) approach that leverages linearization techniques from differential calculus to enable the use of mature and efficient model checking algorithms for transition systems on linear real arithmetic (LRA).
منابع مشابه
Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF
Model checking invariant properties of designs, represented as transition systems, with non-linear real arithmetic (NRA), is an important though very hard problem. On the one hand NRA is a hard-to-solve theory; on the other hand most of the powerful model checking techniques lack support for NRA. In this paper, we present a counterexample-guided abstraction refinement (CEGAR) approach that leve...
متن کاملAdvancing software model-checking by SMT interpolation beyond decidable arithmetic theories: an approach to verify safety properties in embedded and hybrid system models
Envisage a world where embedded and hybrid system models are analysed with scrutiny by algorithms that automatically, efficiently, and unhesitatingly can answer questions about reachability and stability analyses as well as asserting safety of these models. In such a world, embedded and hybrid systems are significantly more reliable than what we currently see in our life; software has fewer bug...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملThe Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach
In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...
متن کاملAIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کامل